One-Lee weight and two-Lee weight $\mathbb{Z}_2\mathbb{Z}_2[u]$-additive codes
نویسندگان
چکیده
In this paper, we study one-Lee weight and two-Lee weight codes over Z2Z2[u], where u = 0. Some properties of one-Lee weight Z2Z2[u]-additive codes are given, and a complete classification of one-Lee weight Z2Z2[u]-additive formally self-dual codes is obtained. The structure of two-Lee weight projective Z2Z2[u] codes are determined. Some optimal binary linear codes are obtained directly from one-Lee weight and two-Lee weight Z2Z2[u]-additive codes via the extended Gray map.
منابع مشابه
Relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive Codes
In this paper, we study a relative two-weight Z2Z4-additive codes. It is shown that the Gray image of a two-distance Z2Z4-additive code is a binary two-distance code and that the Gray image of a relative two-weight Z2Z4-additive code, with nontrivial binary part, is a linear binary relative two-weight code. The structure of relative two-weight Z2Z4-additive codes are described. Finally, we disc...
متن کاملSelf-Dual Codes over $\mathbb{Z}_2\times (\mathbb{Z}_2+u\mathbb{Z}_2)$
In this paper, we study self-dual codes over Z2× (Z2+uZ2), where u 2 = 0. Three types of self-dual codes are defined. For each type, the possible values α, β such that there exists a code C ⊆ Z2×(Z2+uZ2) β are established. We also present several approaches to construct self-dual codes over Z2 × (Z2 + uZ2). Moreover, the structure of two-weight self-dual codes is completely obtained for α · β 6...
متن کاملLinear codes with few weights over $\mathbb{F}_2+u\mathbb{F}_2$
In this paper, we construct an infinite family of five-weight codes from trace codes over the ring R = F2+uF2, where u 2 = 0. The trace codes have the algebraic structure of abelian codes. Their Lee weight is computed by using character sums. Combined with Pless power moments and Newton’s Identities, the weight distribution of the Gray image of trace codes was present. Their support structure i...
متن کامل$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes
Abstract: In this paper, we study ZpZp[u]-additive codes, where p is prime and u 2 = 0. In particular, we determine a Gray map from ZpZp[u] to Z α+2β p and study generator and parity check matrices for these codes. We prove that a Gray map Φ is a distance preserving map from (ZpZp[u],Gray distance) to (Z α+2β p ,Hamming distance), it is a weight preserving map as well. Furthermore we study the ...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کامل